Mapcode Computable Functions
نویسنده
چکیده
In this paper we discuss an alternative definition of a program. We name this formalization as a mapcode and attempt to explore the theoretical issues of computability by mapcodes. We show that mapcodes not only define programs as mathematical entities in a natural manner, but also they are equivalent to Turing machines. The equivalence is shown by proving that the class of mapcode computable functions coincides with the class of Turing computable functions. A sufficient condition for termination of a mapcode is also proved and a related problem is raised.
منابع مشابه
Lp Computable Functions and Fourier Series
This paper studies how well computable functions can be approximated by their Fourier series. To this end, we equip the space of L-computable functions (computable Lebesgue integrable functions) with a size notion, by introducing L-computable Baire categories. We show that L-computable Baire categories satisfy the following three basic properties. Singleton sets {f} (where f is L-computable) ar...
متن کاملComputable Functions of Bounded Variation and Semi-Computable Real Numbers
In this paper we discuss some basic properties of computable real functions which have bounded variations (CBV-functions for short). Especially, it is shown that the image set of semi-computable real numbers under CBV-functions is a proper subset of weakly computable real number class; Two applications of CBV-functions to semi-computable real numbers produce the whole closure of semi-computable...
متن کاملBurchard von Braunmühl, Computable Real Functions of Bounded Variation and Semi-computable Real Numbers
In this paper we discuss some basic properties of computable real functions of bounded variation (CBV-functions for short). Especially, it is shown that the image set of semi-computable real numbers under CBV-functions is a proper subset of the class of weakly computable real numbers; Two applications of CBV-functions to semi-computable real numbers produce the whole closure of semi-computable ...
متن کاملTowards a Physically Meaningful Definition of Computable Discontinuous and Multi-Valued Functions (Constraints)
In computable mathematics, there are known definitions of computable numbers, computable metric spaces, computable compact sets, and computable functions. A traditional definition of a computable function, however, covers only continuous functions. In many applications (e.g., in phase transitions), physical phenomena are described by discontinuous or multi-valued functions (a.k.a. constraints)....
متن کاملA Galois connection between Turing jumps and limits
Limit computable functions can be characterized by Turing jumps on the input side or limits on the output side. As a monad of this pair of adjoint operations we obtain a problem that characterizes the low functions and dually to this another problem that characterizes the functions that are computable relative to the halting problem. Correspondingly, these two classes are the largest classes of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006